Professor King's Synoptical Table

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the 3-kings and 4-kings in multipartite tournaments

Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...

متن کامل

Rainfall and Dragon-Kings

Previous studies have found broad distributions, resembling power laws for different measures of the size of rainfall events. We investigate the large-event tail of these distributions and find in one measure that tropical cyclones account for a large proportion of the very largest events outside the scaling regime, i.e., beyond the cutoff of the power law. Tropical cyclones are sufficiently ra...

متن کامل

The Complexity of Kings

A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...

متن کامل

14 - Of Kings and Capitals

ALAN L. KOLATA Cities, and the larger political formations within which they are embedded, are dynamic congeries of political, economic, and social institutions that are shaped and reshaped by historical circumstance. This dynamism and mutability in the face of exogenou-s forces might suggest the impossibility of a coherent, general theory about the forms and forces of urban transformation of t...

متن کامل

On the Domination of Kings

In this paper, we consider counting the number of ways to place kings on an k × n chessboard, such that every square is dominated by a king. Let f(k, n) be the number of dominating configurations. We consider the asymptotic behavior of the function f(k, n).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Geologist

سال: 1862

ISSN: 1359-4656

DOI: 10.1017/s1359465600002689